A Noncommutative Full Completeness Theorem

نویسندگان
چکیده

برای دانلود رایگان متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

The Shuue Hopf Algebra and Noncommutative Full Completeness

We present a full completeness theorem for the multiplicative fragment of a variant of non-commutative linear logic known as cyclic linear logic (CyLL), rst deened by Yetter. The semantics is obtained by considering dinatural transformations on a category of topological vector spaces which are equivariant under certain actions of a noncocommutative Hopf algebra, called the shuue algebra. Multip...

متن کامل

A topological completeness theorem

We prove a topological completeness theorem for innnitary geometric theories with respect to sheaf models. The theorem extends a classical result of Makkai and Reyes, stating that any topos with enough points has an open spatial cover. We show that one can achieve in addition that the cover is connected and locally connected.

متن کامل

A General NP Completeness Theorem

A detailed model of a random access computation over an ab stract domain is presented and the existence of an NP complete problem is proven under broad conditions which unify Cook s theorem and recent results in the real number model by Blum Shub and Smale

متن کامل

Post's Functional Completeness Theorem

The paper provides a new proof, in a style accessible to modern logicians and teachers of elementary logic, of Post's Functional Completeness Theorem. Post's Theorem states the necessary and sufficient conditions for an arbitrary set of (2-valued) truth functional connectives to be expressively complete, that is, to be able to express every (2-valued) truth function or truth table. The theorem ...

متن کامل

Post's Functional Completeness Theorem

The paper provides a new proof, in a style accessible to modern logicians and teachers of elementary logic, of Post's Functional Completeness Theorem. Post's Theorem states the necessary and sufficient conditions for an arbitrary set of (2-valued) truth functional connectives to be expressively complete, that is, to be able to express every (2-valued) truth function or truth table. The theorem ...

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

ژورنال

عنوان ژورنال: Electronic Notes in Theoretical Computer Science

سال: 1996

ISSN: 1571-0661

DOI: 10.1016/s1571-0661(05)82517-4